Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(f(f(f(j,a),b),c),d) |
→ f(f(a,b),f(f(a,d),c)) |
|
There are 4 dependency pairs:
|
| 2: |
|
F(f(f(f(j,a),b),c),d) |
→ F(f(a,b),f(f(a,d),c)) |
| 3: |
|
F(f(f(f(j,a),b),c),d) |
→ F(a,b) |
| 4: |
|
F(f(f(f(j,a),b),c),d) |
→ F(f(a,d),c) |
| 5: |
|
F(f(f(f(j,a),b),c),d) |
→ F(a,d) |
|
Consider the SCC {2-5}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 3, 2006